Understanding and Improving Register Assignment

نویسندگان

  • Cindy Norris
  • James B. Fenwick
چکیده

Register allocation can decrease instruction-level parallelism by prohibiting the scheduler from reordering instructions. The impact of register assignment strategies on a subsequent scheduling phase is explored. A new register assignment strategy and experimental results are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Efficacy of an SFL-Oriented Register Instruction in Improving Iranian EFL Learners’ Writing Performance and Perception: Language Proficiency in Focus

The current study sought to explore the impact of SFL-oriented register instruction on Iranian EFL learner’ writing performance with a central focus on their English proficiency level. As its secondary aim, the study delved deeply into the learners’ perception of the register-based instruction. To these ends, 50 intermediate and 50 advanced Iranian EFL learners were selected randomly and assign...

متن کامل

A post-compilation register re-assignment technique for improving hamming distance based code compression

Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most optimizations employed by compilers tend to focus on parameters such as program performance, minimizing resource dependencies and sometimes the option of reducing code size. This paper describes a post-compilation techni...

متن کامل

Cooperative register assignment and code compaction for digital signal processors with irregular datapaths

We address the phase ordering problem of code compaction and register assignment in a data ow graph compiler. During register assignment, we take into account the instructionlevel parallelism available. Symbolic variables in straightline code are allocated to register set/memory location pairs which maximally preserve the freedom available for code compaction. Whenever necessary, spill code is ...

متن کامل

A Graph-Theoretic Approach for Register File Based Synthesis

With the increasing use of register files as storage elements in integrated circuits, the problem of assigning data variables to ports of register files has assumed significance. The assignment involves simultaneous optimization of several cost functions, namely, number of register files, number of registers and access ports per register file, and the interconnect both internal and external to ...

متن کامل

Title omitted for double-blind reasons

Recent results on the static single assignment (SSA) form open promising directions for the design of new register allocation heuristics for just-in-time (JIT) compilation. In particular, heuristics based on tree scans with two decoupled phases, one for spilling, one for splitting/coloring/coalescing, seem good candidates for designing memory-friendly, fast, and competitive register allocators....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999